Nonuniqueness of best rational Chebyshev approximations on the unit disk
نویسندگان
چکیده
منابع مشابه
Rational Chebyshev Approximation on the Unit Disk
In a recent paper we showed that er ror curves in po lynomia l Chebyshev a p p r o x i m a t i o n of ana ly t ic functions on the unit disk tend to a p p r o x i m a t e perfect circles abou t the origin [23]. M a k i n g use of a theorem of Ca ra th6odo ry and Fej6r, we der ived in the process a me thod for calculat ing near-bes t a p p r o x i m a t i o n s rapid ly by finding the pr incipal...
متن کاملThe Asymptotic Accuracy of Rational Best Approximations to e’ on a Disk
The method described by D. Braess (J. Approx. Theory 40 (1984), 375-379) is applied to study approximation of ez on a disk rather than an interval. Let E,, be the distance in the supremum norm on Izl <p from e' to the set of rational functions of type (m, n). The analog of Braess' result turns out to be E-m!n!pm+n+l m " (m+n)!(m+n+l)! as m+n+co' This formula was obtained originally for a specia...
متن کاملRational Chebyshev Approximations for Fermi-Dirac Integrals of Orders
Rational Chebyshev approximations are given for the complete Fermi-Dirac integrals of orders — \, \ and f. Maximal relative errors vary with the function and interval considered, but generally range down to 10~9 or less.
متن کاملRational Chebyshev Collocation approach in the solution of the axisymmetric stagnation flow on a circular cylinder
In this paper, a spectral collocation approach based on the rational Chebyshev functions for solving the axisymmetric stagnation point flow on an infinite stationary circular cylinder is suggested. The Navier-Stokes equations which govern the flow, are changed to a boundary value problem with a semi-infinite domain and a third-order nonlinear ordinary differential equation by applying proper si...
متن کاملApproximations for node-weighted Steiner tree in unit disk graphs
Given a node-weighted connected graph and a subset of terminals, the problem node-weighted Steiner tree (NWST) seeks a lightest tree connecting a given set of terminals in a node-weighted graph. While NWST in general graphs are as hard as Set Cover, NWST restricted to unit-disk graphs (UDGs) admits X. Xu, H. Du, P.-J. Wan were supported in part by NSF under grant CNS-0831831. Y. Wang was suppor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1983
ISSN: 0021-9045
DOI: 10.1016/0021-9045(83)90099-0